import java.util.HashMap;
import java.util.List;
import java.util.Stack;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: hp
 * Date: 2024-04-07
 * Time: 11:22
 */
public class Test {
    public static void main(String[] args) {
        TreeBianli treeBianli = new TreeBianli();
        TreeBianli.TreeNode root = treeBianli.createNode();

        /*treeBianli.preOrder(root);
        System.out.println();
        treeBianli.PreorderTraversal(root);*/

        /*treeBianli.inOrder(root);
        System.out.println();
        treeBianli.InorderTraversal(root);*/

        /*treeBianli.postOrder(root);
        System.out.println();
        treeBianli.PostorderTraversal(root);*/

        /*System.out.println("======================");

        int ret = treeBianli.Treenumber(root);
        System.out.println(ret);

        treeBianli.size(root);
        System.out.println(TreeBianli.SizeNode);


        System.out.println(treeBianli.leavesSize(root));
        System.out.println("========");
        treeBianli.leavesSize2(root);
        System.out.println(treeBianli.Leaves);

        System.out.println("================");
        System.out.println(treeBianli.getdikcengleave(root,3));

        System.out.println("================");
        System.out.println(treeBianli.HeightTree(root));

        System.out.println("找val");
        TreeBianli.TreeNode valroot = treeBianli.find(root,'H');
        System.out.println(valroot.val);*/


        /*System.out.println("======层序遍历=======");
        treeBianli.levelOrder(root);*/

        /*List<Character> list = treeBianli.preorderTraversal(root);
        System.out.println(list);*/


    }
}
